A Modified Normalized Min - Sum Decoding Algorithm for Irregular LDPC Codes
نویسندگان
چکیده
ABSTRACT In this paper, a modified normalized Min-Sum algorithm (MNMSA) is proposed for decoding irregular Low Density Parity Check Codes (LDPC) with non-uniform degree distribution. The proposed algorithm provides an efficient decoding scheme to enhance the error performance of an irregular LDPC code without increasing the hardware complexity. An efficient 6 bit quantization scheme is utilized in the proposed algorithm with optimally combined normalization and down scaling factors to resolve the magnitude overestimation issue which occurs during iterative message passing process between the nodes. The simulation results demonstrate that the proposed algorithm achieves good decoding performance in terms of Frame Error Rate (FER) and Bit Error Rate (BER) without the requirement of complex arithmetic calculations. Compared to other min sum based decoding algorithms the decoding process of the proposed MNMSA requires only fewer decoding iterations over wide range of signal to noise ratio (SNR) to achieve comparable decoding performance to that of Belief Propagation (BP) algorithm without increasing the hardware complexity.
منابع مشابه
Combined Normalized and Offset Min-Sum Decoding Algorithm for Irregular LDPC Codes
In this paper, a combined normalized and offset min-sum algorithm (NOMSA) is proposed for decoding irregular Low-Density Parity Check (LDPC) codes. The proposed algorithm focuses on improving the decoding performance by avoiding the loss of sign bit information associated with an output reliability value. Also, the proposed algorithm is made suitable for low complexity hardware implementation b...
متن کاملQC LDPC Codes for MIMO and Cooperative Networks using Two Way Normalized Min-Sum Decoding
This paper is based on the magnitude overestimation correction of the variable message by using two normalized factors in each iteration for LDPC min-sum decoding algorithm. The variable message is modified with a normalized factor when there is a sign change and with another normalized factor when there is no sign change during any two consecutive iterations. This paper incorporates QC LDPC co...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملLDPC Code Design for Min-Sum Based Decoding
We consider the problem of designing low-density parity-check (LDPC) codes for min-sum decoding. We wish to find the LDPC ensemble with the best asymptotic performance. In [1], [2], Amraoui and Urbanke proposed an optimization scheme where a combination of density evolution and extrinsic information transfer (EXIT) charts is used to design LDPC codes for the belief propagation decoding algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013